Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
ÁØÁöµµ ÇнÀ¿¡¼ ²ÀÁöÁ¡ Áß¿äµµ¸¦ °í·ÁÇÑ ·¹À̺í Ãß·Ð |
¿µ¹®Á¦¸ñ(English Title) |
A Label Inference Algorithm Considering Vertex Importance in Semi-Supervised Learning |
ÀúÀÚ(Author) |
¿Àº´È
¾çÁöÈÆ
ÀÌÇöÁø
Byonghwa Oh
Jihoon Yang
Hyun-Jin Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 42 NO. 12 PP. 1561 ~ 1567 (2015. 12) |
Çѱ۳»¿ë (Korean Abstract) |
ÁØÁöµµ ÇнÀÀº ±â°è ÇнÀÀÇ ÇÑ ºÐ¾ß·Î¼, ·¹À̺íµÈ µ¥ÀÌÅÍ¿Í ·¹À̺íµÇÁö ¾ÊÀº µ¥ÀÌÅÍ ¸ðµÎ¸¦ »ç¿ëÇÏ¿© ¸ðµ¨À» ÇнÀÇÔÀ¸·Î½á Áöµµ ÇнÀ¿¡ ºñÇØ ¿¹Ãø Á¤È®µµ¸¦ ³ôÀÏ ¼ö ÀÖ´Ù. ÃÖ±Ù °¢±¤¹Þ°í ÀÖ´Â ±×·¡ÇÁ ±â¹Ý ÁØÁöµµ ÇнÀÀº ÀÔ·Â µ¥ÀÌÅ͸¦ ±×·¡ÇÁÀÇ ÇüÅ·Πº¯È¯ÇÏ´Â ±×·¡ÇÁ ±¸Ãà ´Ü°è¿Í À̸¦ »ç¿ëÇÏ¿© ·¹À̺íµÇÁö ¾ÊÀº µ¥ÀÌÅÍÀÇ ·¹À̺íÀ» ¿¹ÃøÇÏ´Â ·¹À̺í Ãß·Ð ´Ü°è·Î ³ª´¶´Ù. ÀÌ Ãß·ÐÀº ÁØÁöµµ ÇнÀ¿¡¼ÀÇ ÆòÈ°µµ °¡Á¤À» ±âº»À¸·Î ÇÑ´Ù. º» ¿¬±¸¿¡¼´Â Ãß°¡·Î °¢ ²ÀÁöÁ¡ Áß¿äµµ¸¦ °áÇÕÇÔÀ¸·Î½á °³¼±µÈ ·¹À̺í Ãß·Ð ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ÀÌ¿Í ÇÔ²² ¾Ë°í¸®ÁòÀÇ ¼ö·Å¼ºÀ» Áõ¸íÇÏ°í, ¶ÇÇÑ ½ÇÇèÀ» ÅëÇØ ¾Ë°í¸®ÁòÀÇ ¿ì¼ö¼ºÀ» °ËÁõÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Abstract Semi-supervised learning is an area in machine learning that employs both labeled and unlabeled data in order to train a model and has the potential to improve prediction performance compared to supervised learning. Graph-based semi-supervised learning has recently come into focus with two phases: graph construction, which converts the input data into a graph, and label inference, which predicts the appropriate labels for unlabeled data using the constructed graph. The inference is based on the smoothness assumption feature of semi-supervised learning. In this study, we propose an enhanced label inference algorithm by incorporating the importance of each vertex. In addition, we prove the convergence of the suggested algorithm and verify its excellence.
|
Å°¿öµå(Keyword) |
±×·¡ÇÁ ±â¹Ý ÁØÁöµµ ÇнÀ
·¹À̺í Ãß·Ð
´º¸¸ ±Þ¼ö
²ÀÁöÁ¡ Áß¿äµµ
graph-based semi-supervised learning
label inference
Neumann series
vertex importance
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|